GNN-Retro: Retrosynthetic Planning with Graph Neural Networks

نویسندگان

چکیده

Retrosynthetic planning plays an important role in the field of organic chemistry, which could generate a synthetic route for target product. The is series reactions are started from available molecules. most challenging problem generation large search space candidate reactions. Estimating cost has been proved effectively to prune space, achieve higher accuracy with same iteration. And estimation one reaction comprised estimations all its reactants. So, how estimate these reactants will directly influence quality results. To get better performance, we propose new framework, named GNN-Retro, retrosynthetic by combining graph neural networks(GNN) and latest algorithm. structure GNN our framework incorporate information neighboring molecules, improve framework. experiments on USPTO dataset show that outperform state-of-the-art methods margin under settings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segmental duration control with asymmetric causal retro-causal neural networks

The generation of pleasant prosody parameters is very important for speech synthesis. A Prosody generation unit can be seen as a dynamical system. In this paper sophisticated time-delay recurrent neural network (NN) topologies are presented which can be used for the modeling of dynamical systems. Within the prosody prediction task left and right context information is known to influence the pre...

متن کامل

Ranking Attack Graphs with Graph Neural Networks

Network security analysis based on attack graphs has been applied extensively in recent years. The ranking of nodes in an attack graph is an important step towards analyzing network security. This paper proposes an alternative attack graph ranking scheme based on a recent approach to machine learning in a structured graph domain, namely, Graph Neural Networks (GNNs). Evidence is presented in th...

متن کامل

Few-Shot Learning with Graph Neural Networks

We propose to study the problem of few-shot learning with the prism of inference on a partially observed graphical model, constructed from a collection of input images whose label can be either observed or not. By assimilating generic message-passing inference algorithms with their neural-network counterparts, we define a graph neural network architecture that generalizes several of the recentl...

متن کامل

Growing adaptive neural networks with graph grammars

This paper describes how graph grammars may be used to grow neural networks. The grammar facilitates a very compact and declarative description of every aspect of a neural architecture; this is important from a software/neural engineering point of view, since the descriptions are much easier to write and maintain than programs written in a high-level language , such as C++, and do not require p...

متن کامل

Graph Classification with 2D Convolutional Neural Networks

Graph learning is currently dominated by graph kernels, which, while powerful, suffer some significant limitations. Convolutional Neural Networks (CNNs) offer a very appealing alternative, but processing graphs with CNNs is not trivial. To address this challenge, many sophisticated extensions of CNNs have recently been introduced. In this paper, we reverse the problem: rather than proposing yet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2022

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v36i4.20318